A Petri Net Semantics for - Calculus ?
نویسندگان
چکیده
A distributed semantics for-calculus, based on P/T Petri nets with inhibitor arcs, is presented. This net semantics is sound w.r.t. the original early transition system semantics: the interleaving semantics of an agent p is retrievable from the net by considering the inter-leaving marking graph for the associated marking dec(p). Furthermore,-calculus is equipped with a multistep and a causal semantics. The latter is compared with recent proposals appeared in the literature.
منابع مشابه
An Operational Petri Net Semantics for the Join-Calculus
We present a concurrent operational Petri net semantics for the join-calculus, a process calculus for specifying concurrent and distributed systems. There often is a gap between system specifications and the actual implementations caused by synchrony assumptions on the specification side and asynchronously interacting components in implementations. The join-calculus is promising to reduce this ...
متن کاملA Multiset Semantics for the pi-Calculus with Replication
A multiset (or Petri net) semantics is de ned for the calculus with replication. The semantic mapping is a strong bisimulation, and structurally congruent processes have the same semantics. This paper is readable without knowledge of Petri nets.
متن کاملStochastic Petri net semantics for stochastic process algebras
In this paper we deene a Stochastic Petri Net (SPN) semantics for Stochastic Process Algebras (SPAs), a recently introduced formalism that ooers a novel approach for performance modeling. The proposed semantics is evaluated in terms of three criteria: Con-currency and Retrievability, as deened by Olderog for untimed net semantics, and Markov Equivalence for the stochastic aspects.
متن کاملPetri Nets Semantics of P-calculus
As p-calculus based on the interleaving semantics cannot depict the true concurrency and has few supporting tools, it is translated into Petri nets. p-calculus is divided into basic elements, sequence, concurrency, choice and recursive modules. These modules are translated into Petri nets to construct a complicated system. Petri nets semantics for p-calculus visualize system structure as well a...
متن کاملA Process Calculus for Expressing Finite Place/Transition Petri Nets
We introduce the process calculus Multi-CCS, which extends conservatively CCS with an operator of strong prefixing able to model atomic sequences of actions as well as multiparty synchronization. Multi-CCS is equipped with a labeled transition system semantics, which makes use of a minimal structural congruence. Multi-CCS is also equipped with an unsafe P/T Petri net semantics by means of a nov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995